The Maki-Thompson Rumor Model on Infinite Cayley Trees
نویسندگان
چکیده
منابع مشابه
Rumor Source Detection for Rumor Spreading on Random Increasing Trees
In a recent paper, Shah and Zaman proposed the rumor center as an effective rumor source estimator for rumor spreading on random graphs. They proved for a very general random tree model that the detection probability remains positive as the number of nodes to which the rumor has spread tends to infinity. Moreover, they derived explicit asymptotic formulas for the detection probability of random...
متن کاملOptimal control of information epidemics modeled as Maki Thompson rumors
We model the spread of information in a homogeneously mixed population using the Maki Thompson rumor model. We formulate an optimal control problem, from the perspective of single campaigner, to maximize the spread of information when the campaign budget is fixed. Control signals, such as advertising in the mass media, attempt to convert ignorants and stiflers into spreaders. We show the existe...
متن کاملRumor Source Obfuscation on Irregular Trees
Anonymous messaging applications have recently gained popularity as a means for sharing opinions without fear of judgment or repercussion. These messages propagate anonymously over a network, typically defined by social connections or physical proximity. However, recent advances in rumor source detection show that the source of such an anonymous message can be inferred by certain statistical in...
متن کاملFinding Rumor Sources on Random Trees
We consider the problem of detecting the source of a rumor which has spread in a network using only observations about which set of nodes are infected with the rumor and with no information as to when these nodes became infected. In a recent work (Shah and Zaman 2010) this rumor source detection problem was introduced and studied. The authors proposed the graph score function rumor centrality a...
متن کاملInfinite Cycles in the Random Stirring Model on Trees
We prove that, in the random stirring model of parameter T > 0 on an infinite rooted tree each of whose vertices has at least two offspring, infinite cycles exist almost surely, provided that T is sufficiently high.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2020
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-020-02623-y